Linear Codes on Solid Bursts and Random Errors
نویسندگان
چکیده
The paper presents lower and upper bounds on the number of parity check digits required for a linear code that detects solid bursts of length b or less and simultaneously any e or less random errors. An example of such a code is also provided. Further, codes capable of detecting and simultaneously correcting such errors have also been dealt with.
منابع مشابه
On Linear Codes Correcting Random and Low-Denslty Burst Errors
This paper presents lower and upper bounds on the number of parity-check digits required for a linear code that corrects random errors and errors which are in the form of low-density bursts.
متن کاملOn 2-repeated Solid Burst Errors
There are several kinds of errors for which error detecting and error correcting codes have been constructed. Solid burst errors are common in many communications. In general communication due to the long messages, the strings of solid bursts of small length may repeat in a vector itself. The concept of repeated bursts is introduced by Beraradi, Dass and Verma[3] which has opened a new area of ...
متن کاملOn Correcting Bursts (and Random Errors) in Vector Symbol (n, k) Cyclic Codes
Simple methods are shown for correcting bursts of large size and bursts combined with random errors using vector symbols and primarily vector XOR and feedback shift register operations. One result is that any (n, k) cyclic code with minimum distance > 2 can correct all full error bursts of length n-k-1 or less if the error vectors are linearly independent. If the bursts are not full but contain...
متن کاملP - bursts in lpγ - spaces
In [3], the author introduced linear partition γ-codes (or lpγ-codes) as a natural generalization of error control codes endowed with the Rosenbloom-Tsfasman(RT) metric [8] to block coding and obtained various lower and upper bounds for the detection and correction of random block errors. However, a practical situation is when block errors are not randomly scattered but are confined to consecut...
متن کاملRandom error and burst correction by iterated codes
Error-correcting codes have contributed in a significant way for both the theoretical referred to as random errors, or else errors can appear in bursts of many errors each It was shown that long LDPC codes with iterative decoding achieve. LDPC codes provide good random error performance nearer to Shannon limit. iterations such errors can be corrected by concatenating LDPC codes with RS codes. b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015